768A - Oath of the Night's Watch - CodeForces Solution


constructive algorithms sortings *900

Please click on ads to support us..

Python Code:

stewards_count = int(input())
stewards = list(map(int, input().strip().split()))
supp = 0
minS = min(stewards)
maxS = max(stewards)
for i in stewards:
    if minS < i < maxS:
        supp += 1
print(supp)

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    vector<int> vec;
    for(int i=0; i<n; i++)
    {
        int x;
        cin>>x;
        vec.push_back(x);
    }
    sort(vec.begin(), vec.end());

    int boro = vec[0];
    int choto = vec[0];
    int distinct = 1;
    for(int i=0; i<n-1; i++)
    {
        if(vec[i] != vec[i+1])
            distinct++;
        if(boro < vec[i+1])
            boro = vec[i+1];
        if(choto > vec[i+1])
            choto = vec[i+1];
    }

    //cout<<"distinct "<<distinct<<endl;

    if(distinct <= 2)
        cout<<0<<endl;
    else
    {
        int cnt=1;
        for(int i=0; i<n; i++)
        {
            if(vec[i] != vec[i+1]) break;
            else cnt++;
        }
        cnt++;
        for(int i=n-1; i>0; i--)
        {
            if(vec[i] != vec[i-1]) break;
            else cnt++;
        }
        cout<<n-cnt<<endl;
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad
710A - King Moves
1131A - Sea Battle
118A - String Task
236A - Boy or Girl
271A - Beautiful Year
520B - Two Buttons
231A - Team
479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets